M2-CYCLE: an Optical Layer Algorithm for Fast Link Failure Detection in All-Optical Mesh Networks

To achieve fast link failure detection in all-optical networks, the notion of monitoring-cycle (m-cycle) is introduced. The best known m-cycle construction algorithm (HST [7]) adopts a spanning tree-based approach. In this paper, we propose a new algorithm M-CYCLE to construct a set of minimum-length mcycles (or m-cycles) for more efficient link failure detection. We prove that the performance of M-CYCLE is never worse than any spanning tree-based approach. Comparing M-CYCLE to the existing algorithms, we show that it uses the least amount of network resources (measured by the number of cycles, cover length and monitoring wavelength requirement) to achieve the most accurate link failure detection (measured by localization degree). Keywords-All-optical networks (AONs); cycle cover; fast link failure detection; monitoring-cycle.